An algebraic cubature formula on curvilinear polygons

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algebraic cubature formula on curvilinear polygons

We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons ...

متن کامل

Gauss-Green cubature over spline curvilinear polygons

We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...

متن کامل

Green’s Identity in Curvilinear Polygons

For PDE examples illuminating the feedback (Redheffer product) theory of conservative boundary control systems, we need to verify conservativity of various hyperbolic PDE’s in domains Ω that have Lipschitz boundaries. A properly rigged version of Green’s Identity is then required on such domains where technical assumptions on functions at the corners of ∂Ω cannot be tolerated; such as present i...

متن کامل

On the composite Bernstein type cubature formula

Considering a given function f ∈ C([0, 1] × [0, 1]), the bivariate interval [0, 1] × [0, 1] is divided in mn equally spaced bivariate subintervals k−1 m , k m × j−1 n , j n , k = 1, m, j = 1, n. On each such type of subinter-vals the Bernstein bivariate approximation formula is applied and a corresponding Bernstein type cubature formula is obtained. Making the sum of mentioned cubature formulas...

متن کامل

Polynomial interpolation and cubature over polygons

We have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation. 2000 AMS subject classification: 65D05...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2011

ISSN: 0096-3003

DOI: 10.1016/j.amc.2011.04.071